Mapping Users across Networks by Manifold Alignment on Hypergraph

نویسندگان

  • Shulong Tan
  • Ziyu Guan
  • Deng Cai
  • Xuzhen Qin
  • Jiajun Bu
  • Chun Chen
چکیده

Nowadays many people are members of multiple online social networks simultaneously, such as Facebook, Twitter and some other instant messaging circles. But these networks are usually isolated from each other. Mapping common users across these social networks will benefit many applications. Methods based on username comparison perform well on parts of users, however they can not work in the following situations: (a) users choose different usernames in different networks; (b) a unique username corresponds to different individuals. In this paper, we propose to utilize social structures to improve the mapping performance. Specifically, a novel subspace learning algorithm, Manifold Alignment on Hypergraph (MAH), is proposed. Different from traditional semi-supervised manifold alignment methods, we use hypergraph to model high-order relations here. For a target user in one network, the proposed algorithm ranks all users in the other network by their possibilities of being the corresponding user. Moreover, methods based on username comparison can be incorporated into our algorithm easily to further boost the mapping accuracy. Experimental results have demonstrated the effectiveness of our proposed algorithm in mapping users across networks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image alignment via kernelized feature learning

Machine learning is an application of artificial intelligence that is able to automatically learn and improve from experience without being explicitly programmed. The primary assumption for most of the machine learning algorithms is that the training set (source domain) and the test set (target domain) follow from the same probability distribution. However, in most of the real-world application...

متن کامل

Conformal mappings preserving the Einstein tensor of Weyl manifolds

In this paper, we obtain a necessary and sufficient condition for a conformal mapping between two Weyl manifolds to preserve Einstein tensor. Then we prove that some basic curvature tensors of $W_n$ are preserved by such a conformal mapping if and only if the covector field of the mapping is locally a gradient. Also, we obtained the relation between the scalar curvatures of the Weyl manifolds r...

متن کامل

Semi-Supervised Affine Alignment of Manifolds

High dimensional data is usually produced by the source that only enjoys a limited number of degrees of freedom. Manifold leaning technique plays an important part in finding the correlation among the high dimensional data datasets. By making use of manifold alignment, the paired mapping relationship can be explored easily. However, the common manifold alignment algorithm can only give the mapp...

متن کامل

Curvature of Hypergraphs via Multi-Marginal Optimal Transport

We introduce a novel definition of curvature for hypergraphs, a natural generalization of graphs, by introducing a multimarginal optimal transport problem for a naturally defined random walk on the hypergraph. This curvature, termed coarse scalar curvature, generalizes a recent definition of Ricci curvature for Markov chains on metric spaces by Ollivier [Journal of Functional Analysis 256 (2009...

متن کامل

Learning on Partial-Order Hypergraphs

Graph-based learning methods explicitly consider the relations between two entities (i.e., vertices) for learning the prediction function. They have been widely used in semi-supervised learning, manifold ranking, and clustering, among other tasks. Enhancing the expressiveness of simple graphs, hypergraphs formulate an edge as a link to multiple vertices, so as to model the higher-order relation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014